package demo;

public class arrangement {
    public int[] arrangeMent(int[] tem) {

        int head = 0;
        int tail = tem.length - 1;
        int temnumber = 0;
        while (head < tail) {
            head++;
            temnumber = tem[head];
            for (int i = head; i < tem.length - 1; i++) {
                tem[i] = tem[i + 1];
            }
            tem[tail] = temnumber;
        }
        // 返回一个已处理完的数组
        return tem;
    }

}